Some Technical Improvements in Adsorption Analysis.
نویسندگان
چکیده
منابع مشابه
Investigating some technical improvements to glueball calculations
We briefly discuss some issues concerning including the pseudoscalar glueball interpolating operators into the variational basis for computing the masses of the η and η ′ mesons. As a start we present some preliminary results for the correlators from pseudoscalar glueball operators on n f = 2+1+1 twisted mass gauge configurations. Preliminary results for the effect of open boundary conditions o...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملTechnical Improvements in Quantitative Susceptibility Mapping Technical Improvements in Quantitative Susceptibility Mapping
............................................................................................................................. iv Acknowledgements ........................................................................................................... vi List of Figures .................................................................................................................... ix List...
متن کاملSome improvements of numerical radius inequalities via Specht’s ratio
We obtain some inequalities related to the powers of numerical radius inequalities of Hilbert space operators. Some results that employ the Hermite-Hadamard inequality for vectors in normed linear spaces are also obtained. We improve and generalize some inequalities with respect to Specht's ratio. Among them, we show that, if $A, Bin mathcal{B(mathcal{H})}$ satisfy in some conditions, it follow...
متن کاملSome Improvements in Fuzzy Turing Machines
In this paper we modify some previous definitions of fuzzy Turing machines to define the notions of accepting and rejecting degrees of inputs, computationally. We use a BFS-based search method and obtain an upper level bound to guarantee the existence of accepting and rejecting degrees. We show that fuzzy, generalized fuzzy and classical Turing machines have the same computational power. Next, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Chemica Scandinavica
سال: 1948
ISSN: 0904-213X
DOI: 10.3891/acta.chem.scand.02-0574